Chromatic polynomial

Results: 49



#Item
11c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2004-03-11 06:32:34
12c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. 
 DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation

c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2006-01-18 09:22:02
13THEOREM OF THE DAY Tutte’s Golden Identity Let T be an n-vertex planar triangulation with chromatic polynomial P(T, λ), √  and let ϕ denote 12 1 + 5 , the golden ratio. Then

THEOREM OF THE DAY Tutte’s Golden Identity Let T be an n-vertex planar triangulation with chromatic polynomial P(T, λ), √  and let ϕ denote 12 1 + 5 , the golden ratio. Then

Add to Reading List

Source URL: www.theoremoftheday.org

Language: English - Date: 2014-09-11 06:34:31
    14THE CHROMATIC POLYNOMIAL OF FATGRAPHS AND ITS CATEGORIFICATION MARTIN LOEBL AND IAIN MOFFATT Abstract. Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homol

    THE CHROMATIC POLYNOMIAL OF FATGRAPHS AND ITS CATEGORIFICATION MARTIN LOEBL AND IAIN MOFFATT Abstract. Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homol

    Add to Reading List

    Source URL: iti.mff.cuni.cz

    Language: English - Date: 2016-02-04 05:53:37
      15POTTS PARTITION FUNCTION AND ISOMORPHISMS OF TREES ´ MARTIN LOEBL AND JEAN-SEBASTIEN SERENI Abstract. We explore the well-known Stanley conjecture stating that the symmetric chromatic polynomial distinguishes nonisomorp

      POTTS PARTITION FUNCTION AND ISOMORPHISMS OF TREES ´ MARTIN LOEBL AND JEAN-SEBASTIEN SERENI Abstract. We explore the well-known Stanley conjecture stating that the symmetric chromatic polynomial distinguishes nonisomorp

      Add to Reading List

      Source URL: iti.mff.cuni.cz

      Language: English - Date: 2016-02-04 05:53:39
        16reg4-n50-c512M-b1M.time.ps

        reg4-n50-c512M-b1M.time.ps

        Add to Reading List

        Source URL: homepages.ecs.vuw.ac.nz

        Language: English - Date: 2008-10-16 17:32:45
        17THE CHROMATIC POLYNOMIAL OF FATGRAPHS AND ITS CATEGORIFICATION arXiv:math/0511557v3 [math.CO] 28 NovMARTIN LOEBL AND IAIN MOFFATT

        THE CHROMATIC POLYNOMIAL OF FATGRAPHS AND ITS CATEGORIFICATION arXiv:math/0511557v3 [math.CO] 28 NovMARTIN LOEBL AND IAIN MOFFATT

        Add to Reading List

        Source URL: arxiv.org

        Language: English - Date: 2008-02-08 13:12:56
          18

          PDF Document

          Add to Reading List

          Source URL: homepages.ecs.vuw.ac.nz

          Language: English - Date: 2010-05-03 16:43:24
          19Flows and Tensions  Relative Polytopal Complexes modular tension polynomial

          Flows and Tensions Relative Polytopal Complexes modular tension polynomial

          Add to Reading List

          Source URL: linux.bucknell.edu

          Language: English - Date: 2010-08-03 01:40:24
          20MATH 890: Enumerative Geometric Combinatorics Matthias Beck SF State Fall 2015 Tue/Thu 9:35–10:50

          MATH 890: Enumerative Geometric Combinatorics Matthias Beck SF State Fall 2015 Tue/Thu 9:35–10:50

          Add to Reading List

          Source URL: math.sfsu.edu

          Language: English - Date: 2015-03-19 13:54:29